GCD-Free Algorithms for Computing Modular Inverses
نویسندگان
چکیده
This paper describes new algorithms for computing a modular inverse e−1 mod f given coprime integers e and f . Contrary to previously reported methods, we neither rely on the extended Euclidean algorithm, nor impose conditions on e or f . The main application of our gcd-free technique is the computation of an RSA private key in both standard and CRT modes based on simple modular arithmetic operations, thus boosting real-life implementations on crypto-accelerated devices.
منابع مشابه
Computational Number Theory and Applications to Cryptography
• Greatest common divisor (GCD) algorithms. We begin with Euclid’s algorithm, and the extended Euclidean algorithm [2, 12]. We will then discuss variations and improvements such as Lehmer’s algorithm [14], the binary algorithms [12], generalized binary algorithms [20], and FFT-based methods. We will also discuss how to adapt GCD algorithms to compute modular inverses and to compute the Jacobi a...
متن کاملModular algorithms for computing Gröbner bases
Intermediate coefficient swell is a well-known difficulty with Buchberger’s algorithm for computing Gröbner bases over the rational numbers. p-Adic and modular methods have been successful in limiting intermediate coefficient growth in other computations, and in particular in the Euclidian algorithm for computing the greatest common divisor (GCD) of polynomials in one variable. In this paper we...
متن کاملA Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(α1, . . . , αn). Langemyr and McCallum have already shown how Brown’s modular GCD algorithm for polynomials over Q can be modified to work for Q(α) and subsequently, Langemyr extended the algorithm to L[x]. Encarnacion also showed how to use rational number to make the algorithm for Q(α) output sensi...
متن کاملOn Degrees of Modular Common Divisors and the Big Prime gcd Algorithm
We consider a few modifications of the Big prime modular gcd algorithm for polynomials in Z[x]. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors of a resultant and on finding preliminary bounds on degrees of common divisors using auxiliary primes. These modifications are used to suggest improved algorithms f...
متن کاملSharp Estimates for the Main Parameters of the Euclid Algorithm
We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid algorithm, and we study in particular the distribution of the bit-complexity which involves two main parameters : digit–costs and length of continuants. We perform a “dynamical analysis” which heavily uses the dynamical system underlying the Euclidean algorithm. Baladi and Vallée [2] have recently de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003